Sums Representing Fourier Transforms

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cosine Products, Fourier Transforms, and Random Sums

one gets the first actual formula for 7r that mankind ever discovered, dating from 1593 and due to Frangois Viete (1540-1603), whose Latinized name is Vieta. (Was any notice taken of the formula's 400th anniversary, perhaps by the issue of a postage stamp?) From the samples of a function t(x) at equally spaced points x", n E z, one can reconstruct the complete function with the aid of sin x/x, ...

متن کامل

Mellin Transforms: Harmonic Sums

My assignment is going to introduce the Mellin transform and its application on harmonic sums [1]. Hjalmar Mellin(1854-1933, [2] for a summary of his works) gave his name to the Mellin transform, a close relative of the integral transforms of Laplace and Fourier. Mellin transform is useful to the asymptotic analysis of a large class of sums that arise in combinatorial mathematics, discrete prob...

متن کامل

Sparse Generalized Fourier Transforms ∗

Block-diagonalization of sparse equivariant discretization matrices is studied. Such matrices typically arise when partial differential equations that evolve in symmetric geometries are discretized via the finite element method or via finite differences. By considering sparse equivariant matrices as equivariant graphs, we identify a condition for when block-diagonalization via a sparse variant ...

متن کامل

Quadratic Fourier Transforms

In this paper we shall examine the quadratic Fourier transform which is introduced by the generalized quadratic function for one order parameter in the ordinary Fourier transform. This will be done by analyzing corresponding six subcases of the quadratic Fourier transform within a reproducing kernel Hilbert spaces framework. Center for R&D in Mathematics and Applications, Department of Mathemat...

متن کامل

Fast Fourier Transforms

29 O(b log(b)) operations (using standard multiplication). As there are O(b= log(b)) primes in total, the running time of this stage of the algorithm is O(b 2 L), even using the \grammar school" method of integer multiplication. At this stage of the algorithm we have obtained a vector of length L whose entries are integral linear combinations of powers of with coeecients bounded by M in absolut...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1952

ISSN: 0002-9939

DOI: 10.2307/2031901